MDSM: Microarray database schema matching using the Hungarian method
نویسندگان
چکیده
Current microarray databases use different terminologies and structures and thereby limit the sharing of data and collating of results between laboratories. Consequently, an effective integrated microarray data model is required. One important process to develop such an integrated database is schema matching. In this paper, we propose an effective schema matching approach called MDSM, to syntactically and semantically map attributes of different microarray schemas. The contribution from this work will be used later to create microarray global schemas. Since microarray data is complex, we use microarray ontology to improve the measuring accuracy of the similarity between attributes. The similarity relations can be represented as weighted bipartite graphs. We determine the best schema matching by computing the optimal matching in a bipartite graph using the Hungarian optimisation method. Experimental results show that our schema matching approach is effective and flexible to use in different kinds of database models such as; database schema, XML schema, and web site map. Finally, a case study on an existing public microarray schema is carried out using the proposed method
منابع مشابه
Evaluation of Spatial Similarity Methods for Image Retrieval
Similarity retrieval by spatial content (i.e., using multiple objects and their interelationships) in Image DataBases (IDBs) is still an open problem and has received considerable attention in the literature. In this work, we focus our attention on “queries by example” image and we study methods for answering such queries including the well accepted “editing distance” on Attributed Relational G...
متن کاملDatabase Schema Matching using Corpus-based Semantic Similarity and Word Segmentation
In this paper, we present a new method for database schema matching, the problem of identifying elements of two given schemas that correspond to each other. We use two methods based on a large text corpus: one method for determining the semantic similarity of two target words and the other for automatic word segmentation. We present a name-based element-level database schema matching method tha...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملA Linear Formulation of the Graph Edit Distance for Graph Recognition
An efficient graph matching algorithm based on optimizing the graph edit distance is presented. The graph edit distance is expressed as a linear function of a permutation matrix and a sequence of edit matrices which represent graph edit operations. This allows the development of a linear program that is solved using an interior point method. The linear optimization produces a continuous analog ...
متن کاملComparing geospatial entity classes: an asymmetric and context-dependent similarity measure
Semantic similarity plays an important role in geographic information systems as it supports the identification of objects that are conceptually close, but not identical. Similarity assessments are particularly important for retrieval of geospatial data in such settings as digital libraries, heterogeneous databases, and the World Wide Web. Although some computational models for semantic similar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 176 شماره
صفحات -
تاریخ انتشار 2006